BCS Reasoning about Prolog Programs : from Modes through Types
نویسندگان
چکیده
We provide here a systematic comparative study of the relative strength and expressive power of a number of methods for program analysis of Prolog. Among others we show that these methods can be arranged in the following hierarchy: mode analysis) type analysis) monotonic properties) non-monotonic run-time properties. We also discuss a method allowing us to prove global run-time properties.
منابع مشابه
Reasoning Agents in Dynamic Domains
The paper discusses an architecture for intelligent agents based on the use of A-Prolog-a language of logic programs under the answer set semantics. A-Prolog is used to represent the agent's knowledge about the domain and to formulate the agent's reasoning tasks. We outline how these tasks can be reduced to answering questions about properties of simple logic programs and demonstrate the method...
متن کاملReasoning Agents in Dynamic
The paper discusses an architecture for intelligent agents based on the use of A-Prolog-a language of logic programs under the answer set semantics. A-Prolog is used to represent the agent's knowledge about the domain and to formulate the agent's reasoning tasks. We outline how these tasks can be reduced to answering questions about properties of simple logic programs and demonstrate the method...
متن کاملComparing Negation in Logic Programming and in Prolog
We compare here two uses of negation { in logic programming and in Prolog. As in Prolog negation is deened by means of meta-programming facilities and the cut operator, this requires a careful reexamination of the assumptions about the underlying syntax and a precise deenition of the computational processes involved. After taking care of these matters we establish a formal result showing an equ...
متن کاملProgram Veriication and Prolog
We show here that veriication of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of oundering. Finally, we discuss which aspects of these techniques can be automated. Notes.
متن کاملVerification of Logic Programs and Imperative Programs
This paper explores the relationship between veriication of logic programs and imperative programs with the aim of uncovering the kinds of reasoning used to construct logic programs. We discuss forward reasoning, such as that used for verifying imperative programs using the inductive assertion method, and backward reasoning, such as that used for verifying imperative programs using subgoal indu...
متن کامل